CCMbAS: A Provably Secure CCM-Based Authentication Scheme for Mobile Internet
نویسندگان
چکیده
To improve the security of authentication system and strengthen privacy protection in mobile Internet environment, this paper proposes a provably secure Chebyshev chaotic map (CCM)-based scheme (CCMbAS). The proposed transformed traditional public key into private combined two keys to compute one-time used encrypt information. is verified using review BAN logic ProVerif simulation tool. verification results confirm that well secured against all existing threats. Compared with similar schemes, more efficient secure. analysis shows can fulfil demands ensure user’s information environment.
منابع مشابه
A Provably-Secure ECC-Based Authentication Scheme for Wireless Sensor Networks
A smart-card-based user authentication scheme for wireless sensor networks (in short, a SUA-WSN scheme) is designed to restrict access to the sensor data only to users who are in possession of both a smart card and the corresponding password. While a significant number of SUA-WSN schemes have been suggested in recent years, their intended security properties lack formal definitions and proofs i...
متن کاملProvably Secure Metering Scheme
Naor and Pinkas introduced metering schemes at Eurocrypt '98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number, say k, of clients. This paper rst shows an attack for their schemes such that only two malicious clients can prevent a s...
متن کاملProvably Secure Certificate-based Signature Scheme for Ad Hoc Networks
Certificate-based cryptography proposed by Gentry in Eurocrypt 2003 combines the advantages of traditional public key cryptography (PKI) and identitybased cryptography, and removes the certificate management problem and the private key escrow security concern. Based on computational Diffie-Hellman assumption, a certificate-based signature scheme is constructed to insure the security of communic...
متن کاملA Provably Secure Group Signature Scheme from Code-Based Assumptions
We solve an open question in code-based cryptography by introducing the first provably secure group signature scheme from codebased assumptions. Specifically, the scheme satisfies the CPA-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem, the Learning Parity with Noise problem, and a variant of the Syndrome Decoding problem. Our co...
متن کاملA provably secure code-based concurrent signature scheme
Concurrent signatures allow two entities to generate two signatures in such a way that both signatures are ambiguous till some information is revealed by one of the parties. This kind of signature is useful in auction protocols and a wide range of scenarios in which involving participants are mutually distrustful. In this paper, to have quantum-attack-resistant concurrent signatures as recommen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mobile Information Systems
سال: 2022
ISSN: ['1875-905X', '1574-017X']
DOI: https://doi.org/10.1155/2022/7318948